List-recoloring of sparse graphs
نویسندگان
چکیده
Fix a graph G , list-assignment L for and -colorings α β . An -recoloring sequence, starting from recolors single vertex at each step, so that resulting intermediate coloring is proper -coloring. sequence transforms to if its initial final We prove there exists an most constant number of times (i) triangle-free planar 7-assignment, or (ii) mad ( ) < 17 / 5 6-assignment (iii) 22 9 4-assignment. Parts confirm conjectures Dvořák Feghali.
منابع مشابه
Fast Recoloring of Sparse Graphs
In this paper, we show that for every graph of maximum average degree bounded away from d, any (d + 1)-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current coloring is proper. In particular, it implies that we can transform any 8-coloring of a planar graph into any other 8-coloring with a polynomial number of recolori...
متن کاملRecoloring Directed Graphs
Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings β and φ are joined by a directed edge β → φ if φ is obtained from β by choosing a vertex v and recoloring v so that its color is different from the colors of all its out-neighbors. We investigate reachabil...
متن کاملList-colouring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs. We show that the choosability χ (G2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ (G2) is at most five if d < 7/3 an...
متن کاملList-Coloring Squares of Sparse Subcubic Graphs
The problem of colouring the square of a graph naturally arises in connection with the distance labelings, which have been studied intensively. We consider this problem for sparse subcubic graphs and show that the choosability χ`(G 2) of the square of a subcubic graph G of maximum average degree d is at most four if d < 24/11 and G does not contain a 5-cycle, χ`(G 2) is at most five if d < 7/3 ...
متن کاملRecoloring bounded treewidth graphs
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Any graph is (tw + 2)-mixing, where tw is the treewidth of the graph (Cereceda 2006). We prove that the shortest sequence between any two (tw + 2)-colorings is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2022
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2022.103562